Probabilistic Algorithms in Finite Fields
نویسندگان
چکیده
منابع مشابه
Algorithms for Exponentiation in Finite Fields
and infinitely many integers n, multiplication in a normal basis of Fqn over Fq can be computed with O(n logn loglogn), division with O(n log n loglogn) operations in Fq , and exponentiation of an arbitrary element in Fqn with O(n2 loglogn) operations in Fq . We also prove that using a polynomial basis exponentiation in F2n can be done with the same number of operations in F2 for all n. The pre...
متن کاملGenetic algorithms in probabilistic finite element analysis of geotechnical problems
In application to numerical analysis of geotechnical problems, the limit-state surface is usually not known in any closed form. The probability of failure can be assessed via the so-called reliability index. A minimization problem can naturally be formed with an implicit equality constraint defined as the limit-state function and optimization methods can be used for such problems. In this paper...
متن کاملCharacteristic set algorithms for equation solving in finite fields
Efficient characteristic set methods for computing solutions of a polynomial equation system in a finite field is proposed. We introduce the concept of proper triangular sets and prove that proper triangular sets are square-free in certain sense. We present an improved algorithm which can be used to reduce the zero set of an equation system in general form as the union of zero sets of proper tr...
متن کاملOn Chudnovsky-Based Arithmetic Algorithms in Finite Fields
Thanks to a new construction of the so-called Chudnovsky-Chudnovsky multiplication algorithm, we design efficient algorithms for both the exponentiation and the multiplication in finite fields. They are tailored to hardware implementation and they allow computations to be parallelized while maintaining a low number of bilinear multiplications. We give an example with the finite field F1613 .
متن کاملA Lower Bound for Probabilistic Algorithms for Finite State Machines
Freivalds recently reported a construction of a 2-way probabilistic finite automaton A4 that recognizes the set Iambm : m b 1) with arbitrarily small probability of error. This result implies that probabilistic machines of this type are more powerful than their deterministic. nondeterministic, and alternating counterparts. Freivalds' construction has a negative feature: the automaton A4 runs in...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Computing
سال: 1980
ISSN: 0097-5397,1095-7111
DOI: 10.1137/0209024